Impartial achievement and avoidance games for generating finite groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Impartial achievement games for generating generalized dihedral groups

We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nimnumbers of this game for generalized dihedral groups, which are of the form Dih(A) = Z2 n A for a finite abelian group A.

متن کامل

Achievement and Avoidance Games for Generating Abelian Groups

A b s t r a c t : For any finite group G, the DO GENERATE game is played by two players Alpha and Beta as follows. Alpha moves first and chooses x 1 C G. The k-th play consists o f a choice of x g E G S k _ 1 where S n = ~x 1 . . . . . X n } . Let G n = . The game ends when G n = G. The player who moves x n wins. In the corresponding avoidance game, DON'T GENERATE, the last player to move l...

متن کامل

Misère quotients for impartial games

We announce misère-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misère quotients—commutative monoids that encode the additive structure of specific misère-play games. We also introduce several advances in the structure theory of misère quotients, including a connection between the combinatorial structure of normal and misère play.

متن کامل

Infinite Cyclic Impartial Games

We define the family of locally path-bounded digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible, in a finite number of moves. This is done by proving that the Generalized Sprague-Grundy function exists uniquely and has finite values on this class.

متن کامل

Three-player impartial games

Past efforts to classify impartial three-player combinatorial games (the theories of Li [3] and Straffin [4]) have made various restrictive assumptions about the rationality of one’s opponents and the formation and behavior of coalitions. One may instead adopt an agnostic attitude towards such issues, and seek only to understand in what circumstances one player has a winning strategy against th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 2017

ISSN: 0020-7276,1432-1270

DOI: 10.1007/s00182-017-0602-x